INFLUENCE OF ROOT IRREGULARITY ON FATIGUE STRENGTH OF PARTIALLY-PENETRATED LONGITUDINAL WELDS
نویسندگان
چکیده
منابع مشابه
the influence of the neo-platonic concept of poetic imagination on wordsworth’s poetry
بر اساس نظریه افلاطون در باره شعر خلاقیت هنری مورد انتقاد قرار گرفته است. نظریه کلی در مورد شعر این بود که شعر از ظواهرتقلید میکند و نه حقیقت. چون سایه ای از حقیقت است. اما با پیدایش فلسفه نو افلاطونی، انتقاتات قبلی در مورد شعر و شاعری اصلاح شد. فلوطین در کتاب انئید، اساس خلق هنری را بر محور مُثل افلاطونی قرار داد. وی باور داشت که هنر مندان در خلق آثار هنری، تحت تاثیر مُثل افلاطونی بوده و عوالمی ...
the effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
On graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular, if the weighted degrees of the vertices are all different. The irregularity strength, s(G), is the maximal weight, minimized over all irregular assignments. In this study, we show that s(G) c1 n / , for graphs with maximum degree n and minimum
متن کاملIrregularity strength of digraphs
It is an elementary exercise to show that any non-trivial simple graph has two vertices with the same degree. This is not the case for digraphs and multigraphs. We consider generating irregular digraphs from arbitrary digraphs by adding multiple arcs. To this end, we define an irregular labeling of a digraph D to be an arc labeling of the digraph such that the ordered pairs of the sums of the i...
متن کامل240 on Graphs of Irregularity Strength 2
We consider undirected graphs without loops or multiple edges. A weighting of a graph G is an assignment of a positive integer w( e) to each edge of G. For a vertex x€V(G), the (weighted) degree d(x) is the sum ofweights on the edges ofG incident to x. The irregularity strength s( G) of a graph G was introduced by Chartrand et al. in [1] a.s the minimum integer t such that G has a weighting wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Society of Civil Engineers
سال: 1983
ISSN: 1884-4936,0385-5392
DOI: 10.2208/jscej1969.1983.337_223